On a nonparametric resampling scheme for Markov random fields
نویسندگان
چکیده
منابع مشابه
Texture Classification Using Nonparametric Markov Random Fields
We present a nonparametric Markov Random Field model for classifying texture in images. This model can capture the characteristics of a wide variety of textures, varying from the highly structured to the stochastic. The power of our modelling technique is evident in that only a small training image is required, even when the training texture contains long range characteristics. We show how this...
متن کاملMarkov Random Fields and Conditional Random Fields
Markov chains provided us with a way to model 1D objects such as contours probabilistically, in a way that led to nice, tractable computations. We now consider 2D Markov models. These are more powerful, but not as easy to compute with. In addition we will consider two additional issues. First, we will consider adding observations to our models. These observations are conditioned on the value of...
متن کاملA recursive algorithm for Markov random fields
We propose a recursive algorithm as a more useful alternative to the Brook expansion for the joint distribution of a vector of random variables when the original formulation is in terms of the corresponding full conditional distributions, as occurs for Markov random fields. Usually, in practical applications, the computational load will still be excessive but then the algorithm can be used to o...
متن کاملTexture Synthesis and Nonparametric Resampling of Random Fields by Elizaveta Levina
This paper introduces a nonparametric algorithm for bootstrapping a stationary random field and proves certain consistency properties of the algorithm for the case of mixing random fields. The motivation for this paper comes from relating a heuristic texture synthesis algorithm popular in computer vision to general nonparametric bootstrapping of stationary random fields. We give a formal resamp...
متن کاملOn a Parameter Estimation Method for Gibbs-Markov Random Fields
Fig. 2. space by Patrick-Fisher's algorithm (solid line) and E (dotted line). Bayes error estimates for SONAR data transformed to IO-dimensional high-dimensional data these results might be more in favor of E.) This is a result of the fact that each iteration of simplex requires that the samples be transformed to the low-dimensional space, and then the Bayes error estimated in that space, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2011
ISSN: 1935-7524
DOI: 10.1214/11-ejs644